Learning by Cooperating Agents
نویسنده
چکیده
Most algorithms for learning and pattern discovery in data assume that all the needed data is available on one computer at a single site. This assumption does not hold in situations where a number of independent databases reside on different nodes of a network. These databases cannot be moved to a common shared site due to size, security, privacy, legal, and data-ownership concerns but all of them together constitute the dataset in which patterns must be discovered. These databases, however, may be made accessible for certain types of queries and all such communications for a database may be channeled through an intelligent agent interface. In this paper we show how a decision-tree induction algorithm may be adapted for such situations and implemented in terms of communications among the interface agents.
منابع مشابه
Solution Consistency and Convergence in Cooperative Distributed Problem Solving
A negotiation strategy for resolving conflicts in cooperative distributed problem solving is presented. The strategy, which is called Progressive Negotiation, aims at minimizing backtracking to previous solutions and provably guarantees the consistency of distributed solutions and the convergence on a globally-satisfiable solution among heterogeneous cooperating agents. The progressive negotiat...
متن کاملMACSIMA: An Agent Framework For Simulating The Evolution Of Negotiation Strategies In B2B-Networked Economies
In this paper, we describe the multiagent supply chain simulation framework MACSIMA. This framework allows the design of large-scale supply network topologies consisting of a multitude of autonomous agents representing the companies in the supply network and acting on their behalf. MACSIMA provides all agents with negotiation and learning capabilities so that the co-evolution and adaptation of ...
متن کاملModeling Ant Colony Algorithms Using Learning Automata
Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by ants foraging for food. In these algorithms there are some agents, the ants, that for finding the suitable solution, search the solution space. On the other hand, Learning Automata is an abstract model that can do finite actions. Each selected action is evaluated by a random environment and the env...
متن کاملrogressive Negotiation Ong istri Heterogeneous Cooperating Agents
Progressive negotiation is a strategy for resolving conflicts among distributed heterogeneous cooperating agents. This strategy aims at minimizing backtracking to previous solutions and provably ensures consistency of agents’ distributed solutions and convergence on a globallysatisfiable solution. The progressive negotiation strategy is enforced by a task-independent agent called Facilitator, w...
متن کاملEvolving Neural Networks for Forest Fire Control
Forest fire control is a challenging research problem involving a non-stationary environment and multiple cooperating agents. In this paper we describe the application of enforced sub-populations (ESP) to evolve neural network controllers that solve different instances of the forest fire control problem. Our system works by initially generating subgoals and assigning subgoals to the different a...
متن کاملReinforcement Learning with Internal Reward for Multi-Agent Cooperation: A Theoretical Approach
This paper focuses on a multi-agent cooperation which is generally di cult to be achieved without su cient information of other agents, and proposes the reinforcement learning method that introduces an internal reward for a multi-agent cooperation without su cient information. To guarantee to achieve such a cooperation, this paper theoretically derives the condition of selecting appropriate act...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002